| Name | Version | Summary | date |
| python-igraph |
1.0.0 |
High performance graph data structures and algorithms (legacy package) |
2025-10-23 12:28:36 |
| igraph |
1.0.0 |
High performance graph data structures and algorithms |
2025-10-23 12:22:50 |
| himpunan-maths-discrete |
1.0.1 |
Implementasi teori himpunan untuk Matematika Diskrit dalam Python |
2025-10-22 03:29:22 |
| mapFolding |
0.16.4 |
Map folding, meanders, stamp folding, semi-meanders. Experiment with algorithm transformations, and analyze computational states. |
2025-10-07 09:28:53 |
| lucas-igraph |
0.11.9.2 |
High performance graph data structures and algorithms |
2025-08-19 22:15:10 |
| graphdict |
3.4.13 |
Python package for creating and manipulating graphs and networks |
2025-07-08 12:59:56 |
| python-graphblas |
2025.2.0 |
Python library for GraphBLAS: high-performance sparse linear algebra for scalable graph analytics |
2025-02-17 23:09:00 |
| graph-theory |
2023.7.8 |
A graph library |
2025-02-02 21:41:53 |
| networkx |
3.4.2 |
Python package for creating and manipulating graphs and networks |
2024-10-21 12:39:38 |
| suitesparse-graphblas |
9.3.1.0 |
SuiteSparse:GraphBLAS Python bindings. |
2024-10-17 21:36:37 |
| pycombo |
0.1.8 |
Python wrapper around Combo network partitioning algorithm (C++) |
2024-09-24 21:42:39 |